Conceptual Clustering of Complex Objects: A Generalization Space based Approach

نویسندگان

  • Isabelle Bournaud
  • Jean-Gabriel Ganascia
چکیده

A key issue in learning from observations is to build a classification of given objects or situations. Conceptual clustering methods address this problem of recognizing regularities among as set of objects that have not been pre-classified, so as to organize them into a hierarchy of concepts. Early approaches have been limited to unstructured domains, in which objects are described by fixed sets of attribute-value pairs. Recent approaches in structured domains use a first order logic based representation to represent complex objects. The problem addressed in this paper is to provide a basis for the analysis of complex objects clustering represented using conceptual graphs formalism. We propose a new clustering method that extracts a hierarchical categorization of the provided objects from an explicit space of concepts hierarchies, called Generalization Space. We give a general algorithm and expose several complexity factors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Objects Organization

This paper addresses the problem of the automatic building of classifications to organize knowledge. The goal is to generate the set of least general generalizations of the objects descriptions: the Generalization Space. An anytime algorithm to build conceptual classifications for complex objects (having sub-parts) represented as conceptual graphs is presented. It is based upon an iterative ref...

متن کامل

Abstractions for Knowledge Organization of Relational Descriptions

ions for Knowledge Organization of Relational Descriptions Isabelle Bournaud, Mélanie Courtine, Jean-Daniel Zucker 1 LRI, Université Paris-Sud, Av. du Général de Gaulle, 91405 Orsay Cedex, France [email protected] 2 LIP6 – Pole IA, Université Paris VI, 4 place Jussieu, 75252 Paris Cedex, France {Melanie.Courtine, Jean-Daniel.Zucker}@lip6.fr Abstract. The goal of conceptual clustering is ...

متن کامل

A Clustering Approach by SSPCO Optimization Algorithm Based on Chaotic Initial Population

Assigning a set of objects to groups such that objects in one group or cluster are more similar to each other than the other clusters’ objects is the main task of clustering analysis. SSPCO optimization algorithm is anew optimization algorithm that is inspired by the behavior of a type of bird called see-see partridge. One of the things that smart algorithms are applied to solve is the problem ...

متن کامل

A Hybrid Time Series Clustering Method Based on Fuzzy C-Means Algorithm: An Agreement Based Clustering Approach

In recent years, the advancement of information gathering technologies such as GPS and GSM networks have led to huge complex datasets such as time series and trajectories. As a result it is essential to use appropriate methods to analyze the produced large raw datasets. Extracting useful information from large data sets has always been one of the most important challenges in different sciences,...

متن کامل

KIDS: An Iterative Algorithm to Organize Relational Knowledge

The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of most specific classes: the Generalization Space. It has applications in the field of data mining, knowledge indexation or knowledge acquisition. Efficient algorithms have been proposed for data described in <attribute, v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995